Novel Devaki Paul Algorithm for Multiple Pattern Matching
نویسندگان
چکیده
منابع مشابه
Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA)
A new algorithm to search for multiple patterns simultaneously is proposed. The multiple pattern algorithms can be used in many applications that require such type of search and matching. For example, a multipattern matching can be used in lieu of indexing or sorting data in some applications that involve small to medium size datasets. One of its advantages is that no additional search structur...
متن کاملA Fast Multiple String-pattern Matching Algorithm
In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...
متن کاملNovel Pattern Matching using FSM Algorithm for Memory Architecture
Network intrusion detection system is used to inspect packet contents against thousands of predefined malicious or suspicious patterns. Because traditional software alone pattern matching approaches can no longer meet the high throughput of today’s networking, many hardware approaches are proposed to accelerate pattern matching. Among hardware approaches, memory-based architecture has attracted...
متن کاملMultiple Pattern Matching Revisited
We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...
متن کاملA Quantum Algorithm for Closest Pattern Matching
We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [7], which rely on building spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/1758-2397